Pairs of complete intersections

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Criteria for complete intersections

We establish two criteria for certain local algebras to be complete intersections. These criteria play an important role in A. Wiles’s proof that all semi-stable elliptic curves over Q are modular. Introduction In this paper we discuss two results in commutative algebra that are used in A. Wiles’s proof that all semi-stable elliptic curves over Q are modular [11]. We first fix some notation tha...

متن کامل

Elliptic Genera of Complete Intersections

We propose a new definition of the elliptic genera for complete intersections, not necessarily nonsingular, in projective spaces. We also prove they coincide with the expressions obtained from Landau-Ginzburg model by an elementary argument.

متن کامل

Hodge Numbers of Complete Intersections

Suppose X is a compact Kähler manifold of dimension n and E is a holomorphic vector bundle. For every p ≤ dim C X we have a sheaf Ω p (E) whose sections are holomorphic (p, 0)-forms with coefficients in E. We set and we define the holomorphic Euler characteristics χ p (X, E) := q≥0 (−1) q h p,q (X, E). It is convenient to introduce the generating function of these numbers χ y (X, E) := p≥0 y p ...

متن کامل

Footprint functions of complete intersections

We study the minimum distance function of a complete intersection graded ideal in a polynomial ring with coefficients in a field. For graded ideals of dimension one, whose initial ideal is a complete intersection, we use the footprint function to give a sharp lower bound for the minimum distance function. Then we show some applications to coding theory.

متن کامل

Counting Pairs of Lattice Paths by Intersections

Consider an r × (n − r) plane lattice rectangle, and walks that begin at the origin (south-west corner), proceed with unit steps in either of the directions east or north, and terminate at the north-east corner of the rectangle. For each integer k we ask for N k , the number of ordered pairs of these walks that intersect in exactly k points. The number of points in the intersection of two such ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Pure and Applied Algebra

سال: 1985

ISSN: 0022-4049

DOI: 10.1016/0022-4049(85)90004-0